A Review on Channel Routing On VLSI Physical Design
نویسندگان
چکیده
We know that channel routing is very important problem in VLSI physical design. The main objective of a channel routing algorithm is the reduction of the area of a IC chip. In this paper, we just do a survey on some impotent multi-layer routing algorithms. Here we analyze The Efficient Routing algorithm and resolve horizontal constraints and minimize the net wirelength in a particular model of channel routing using MCC1 and MCC2 algorithms. Next, we analyze an algorithm for Multi channel Routing MulCh and its differences from Chameleon which s another multi channel routing in the two-layer VH and three-layer HVH routing models.
منابع مشابه
An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing
Channel routing is a key problem in the physical design of VLSI chips. It is known that ma4dmz, urn,,) is a lower bound on the number of tmcka requared in the reserved two-layer Manhattan routine model. where d,,,,, is the channel density and vi, is the length oftKe longest path in the vertical constraint omvh. In this paver we vropose a polynomial time algorithm that ‘wmput’es a better and non...
متن کاملOI14: Crossing-Aware Channel Routing for Integrated Optics
Increasing scope and applications of integrated optics necessitates the development of automated techniques for physical design of optical systems. A key area of integrated optic design is waveguide routing, which currently lacks the level of automation found in VLSI design. Unlike VLSI, where signal nets are routed with metal layers and vias, integrated optics is a planar technology and lacks ...
متن کاملAn efficient lower bound algorithm for channel routing
Channel routing plays a central role in the physical design of VLSI chips. For two-layer dogleg-free channel routing, dm,, and v,, are the two traditional lower bounds. In this paper, we present two efficient algorithms for computing a tighter lower bound for the channel routing problem. Our algorithms succe:j~fully compute a lower bound of 26 for Deutsch's Difficult Example (DDE). The experime...
متن کاملAn Effective Memetic Algorithm for Solving Channel Routing Problems
The task of VLSI physical design is to produce the layout of an integrated circuit. The layout problem in VLSI-design can be broken up into the subtasks partitioning, floor p lanning, placement and routing. Routing can be classified into two types. One is Global routing and another one is detailed routing. In detailed routing, the Connections between blocks or cells, respectively, have to be ge...
متن کاملA Genetic Algorithm for Channel Routing in VLSI Circuits
A new genetic algoriihm for channel routing in $he physical design process of L'LSI circtiis i5 prestsfed. The algorithm is bused on a problem specific represen-iadion scheme and problem speciJc genetic operators. The geneiic encoding and our genelic operators are descrabed in defoii. The performance of.the algoriihnt is tested on difleerrnl benchmarks and it is shown that the results obdained ...
متن کامل